A divide-and-conquer strategy to solve the out-of-memory problem of processing thousands of Affymetrix microarrays
نویسندگان
چکیده
Out-of-memory problem was frequently encountered when processing thousands of CEL files using Bioconductor. We propose a divide-and-conquer strategy combined with randomised resampling to solve this problem. The CAMDA 2007 META-analysis data set which contains 5896 CEL files was used to test the approach on a typical commodity computer cluster by running established pre-processing algorithms for Affymetrix arrays in the Bioconductor package. The results were validated against a golden standard obtained by using a supercomputer. In addition to the performance improvement, the general divide-and-conquer strategy can be applied to any other normalisation algorithms without modifying the underlying implementation.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملA Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem
This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...
متن کاملFast Reconstruction of SAR Images with Phase Error Using Sparse Representation
In the past years, a number of algorithms have been introduced for synthesis aperture radar (SAR) imaging. However, they all suffer from the same problem: The data size to process is considerably large. In recent years, compressive sensing and sparse representation of the signal in SAR has gained a significant research interest. This method offers the advantage of reducing the sampling rate, bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International journal of computational biology and drug design
دوره 1 4 شماره
صفحات -
تاریخ انتشار 2008